Stochastic Integration Based on Simple, Symmetric Random Walks
نویسندگان
چکیده
منابع مشابه
Simple Random Walks on Radio Networks (Simple Random Walks on Hyper-Graphs)
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless networks (and other networks), graphs are actually not the correct model of the communication; instead hyper-graphs better capture the communication over a wireless...
متن کاملRandom Walks on Highly Symmetric Graphs
We consider uniform random walks on finite graphs with n nodes. When the hitting times are symmetric, the expected covering time is at least 89 log n O(n log log n) uniformly over all such graphs. We also obtain bounds for the covering times in terms of the eigenvalues of the transition matrix of the Markov chain. For distance-regular graphs, a general lower bound of ( n 1 ) l o g n is obtained...
متن کاملOn symmetric random walks with random conductances on Z
We study models of continuous time, symmetric, Zd-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We consider the case of independent conductances with a polynomial tail near 0 and obtain precise asymptotics for the annealed return probability and convergence t...
متن کاملSimple random walks on wheel graphs
A simple random walk on a graph is defined in which a particle moves from one vertex to any adjacent vertex, each with equal probability. The expected hitting time is the expected number of steps to get from one vertex to another before returning to the starting vertex. In this paper, using the electrical network approach, we provide explicit formulae for expected hitting times for simple rando...
متن کاملRandom Walks on Stochastic Temporal Networks
In the study of dynamical processes on networks, there has been intense focus on network structure—i.e., the arrangement of edges and their associated weights—but the effects of the temporal patterns of edges remains poorly understood. In this chapter, we develop a mathematical framework for random walks on temporal networks using an approach that provides a compromise between abstract but unre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Probability
سال: 2008
ISSN: 0894-9840,1572-9230
DOI: 10.1007/s10959-007-0140-8